Rewrite Proofs and Computations ?
نویسنده
چکیده
Rewriting is a general paradigm for expressing computations in various logics, and we focus here on rewriting techniques in equational logic. When used at the proof level, rewriting provides with a very powerful methodology for proving completeness results, a technique that is illustrated here. We also consider whether important properties of rewrite systems such as connuence and termination can be proved in a modular way. Finally, we stress the links between rewriting and tree automata.
منابع مشابه
Monad normalisation
The usual monad laws can directly be used as rewrite rules for Isabelle’s simplifier to normalise monadic HOL terms and decide equivalences. In a commutative monad, however, the commutativity law is a higher-order permutative rewrite rule that makes the simplifier loop. This AFP entry implements a simproc that normalises monadic expressions in commutative monads using ordered rewriting. The sim...
متن کاملKBCV - Knuth-Bendix Completion Visualizer
This paper describes a tool for Knuth-Bendix completion. In its interactive mode the user only has to select the orientation of equations into rewrite rules; all other computations (including necessary termination checks) are performed internally. Apart from the interactive mode, the tool also provides a fully automatic mode. Moreover, the generation of (dis)proofs in equational logic is suppor...
متن کاملProof Certification in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps∗
We present the certifying part of the Zenon Modulo automated theorem prover, which is an extension of the Zenon tableau-based first order automated theorem prover to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us to rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms i...
متن کاملOn the Complexity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations to normal form and root-stable form in term rewriting. Using elementary tree automata techniques and ground tree transducers we obtained simple decidability proofs for classes of rewrite systems that are much larger than earlier classes defined using the complicated sequentiality concept. In this paper we...
متن کاملScaling termination proofs by a characterization of cycles in CHR
In the current paper, we discuss cycles in Constraint Handling Rules for the purpose of scaling termination proofs. In order to obtain a useful characterization, our approach differs from the ones used in other declarative languages, such as Logic Programming and Term Rewrite Systems. Due to multi-headed rules, the notion of a cycle is not in direct correspondence with the recursive calls of a ...
متن کامل